Approximating the minimum independent dominating set in perturbed graphs
نویسندگان
چکیده
منابع مشابه
Approximating the Minimum Independent Dominating Set in Perturbed Graphs
We investigate the minimum independent dominating set in perturbed graphs g(G, p) of input graph G = (V,E), obtained by negating the existence of edges independently with a probability p > 0. The minimum independent dominating set (MIDS) problem does not admit a polynomial running time approximation algorithm with worst-case performance ratio of n1− for any > 0. We prove that the size of the mi...
متن کاملApproximating independent set in perturbed graphs
For the maximum independent set problem, strong inapproximability bounds for worst-case efficient algorithms exist. We give a deterministic algorithm beating these bounds, with polynomial expected running-time for semi-random graphs: An adversary chooses a graph with n vertices, and then edges are flipped with a probability of ε. Our algorithm guarantees an approximation ratio of O( √ nε) for s...
متن کاملOn graphs having a unique minimum independent dominating set
In this paper, we consider graphs having a unique minimum independent dominating set. We first discuss the effects of deleting a vertex, or the closed neighborhood of a vertex, from such graphs. We then discuss five operations which, in certain circumstances, can be used to combine two graphs, each having a unique minimum independent dominating set, to produce a new graph also having a unique m...
متن کاملApproximating minimum independent dominating sets in wireless networks
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded growth are used to characterize wireless communication networks, and this class of graph includes many models known from the literature, e.g. (Quasi) Unit Disk Graphs. An independent dominating set is a dominating set in ...
متن کاملAn independent dominating set in the complement of a minimum dominating set of a tree
We prove that for every tree T of order at least 2 and every minimum dominating set D of T which contains at most one endvertex of T , there is an independent dominating set I of T which is disjoint from D. This confirms a recent conjecture of Johnson, Prier, and Walsh.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.11.010